package seqlist.leetcode;

//链表的中间结点

public class Num876_middleNode {
    public ListNode middleNode(ListNode head) {
        ListNode fast=head;
        ListNode low=head;
        while (fast!=null&&fast.next!=null){
            low=low.next;
            fast=fast.next.next;
        }
        return low;
    }
}
